Packing closed trails into dense graphs
نویسندگان
چکیده
منابع مشابه
Packing closed trails into dense graphs
It has been shown [Balister, 2001] that if n is odd and m1, . . . , mt are integers with mi ≥ 3 and ∑t i=1 mi = |E(Kn)| then Kn can be decomposed as an edge-disjoint union of closed trails of lengths m1, . . . , mt. Here we show that the corresponding result is also true for any sufficiently large and sufficiently dense even graph G.
متن کاملPacking Digraphs With Directed Closed Trails
It has been shown [Balister, 2001] that if n is odd and m1, . . . , mt are integers with mi ≥ 3 and ∑t i=1 mi = |E(Kn)| then Kn can be decomposed as an edge-disjoint union of closed trails of lengths m1, . . . , mt. This result was later generalized [Balister, to appear] to all sufficiently dense Eulerian graphs G in place of Kn. In this article we consider the corresponding questions for direc...
متن کاملDecomposing Complete Tripartite Graphs into Closed Trails of Arbitrary Lengths
The complete tripartite graph Kn,n,n has 3n 2 edges. For any collection of positive integers x1, x2, . . . , xm with m ∑ i=1 xi = 3n 2 and xi > 3 for 1 6 i 6 m, we exhibit an edge-disjoint decomposition of Kn,n,n into closed trails (circuits) of lengths x1, x2, . . . , xm.
متن کاملOn Planar Graphs Arbitrarily Decomposable into Closed Trails
A graph G is arbitrarily decomposable into closed trails (ADCT) if the following is true: Whenever (l1, . . . , lp) is a sequence of integers adding up to |E(G)| and there is a closed trail of length li in G for i = 1, . . . , p, then there is a sequence (T1, . . . , Tp) of pairwise edge-disjoint closed trails in G such that Ti is of length li for i = 1, . . . , p. In the paper it is proved tha...
متن کاملGraphs without spanning closed trails
Jaeger [J. Graph Theory 3 (1979) 91-93] proved that if a graph has two edge-disjoint spanning trees, then it is supereulerian, i.e., that it has a spanning closed trail. Catlin [J. Graph Theory 12 (1988) 29-45] showed that if G is one edge short of having two edge-disjoint spanning trees, then G has a cut edge or G is supereulerian. Catlin conjectured that if a connected graph G is at most two ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2003
ISSN: 0095-8956
DOI: 10.1016/s0095-8956(02)00039-4